Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets With Flexible Lengths
نویسندگان
چکیده
This paper aims to construct optimal Z-complementary code set (ZCCS) with non-power-of-two (NPT) lengths enable interference-free multicarrier code-division multiple access (MC-CDMA) systems. The existing ZCCSs NPT lengths, which are constructed from generalized Boolean functions (GBFs), sub-optimal only respect the size upper bound. For first time in literature, we advocate use of pseudo-Boolean (PBFs) (each transforms a number binary variables real as natural generalization GBF) for direct constructions lengths.
منابع مشابه
Locally monotone Boolean and pseudo-Boolean functions
We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...
متن کاملOptimal Base Encodings for Pseudo-Boolean Constraints
This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSat. Experimentation indicates that our algorithm scales to bases involving numbers up to 1,000,000, improving on the restricti...
متن کاملNew Results for Sets of Boolean Functions
Traditionally Sum-Of-Products (SOPs) have been studied as expressions of Boolean functions. It has been shown by Sasao in [7] that Exclusive-or-Sum-Of-Products (ESOPs) are more compact representations of Boolean functions than SOPs. The problem to identify an exact minimal ESOP of a Boolean function is despite of some partial results still unsolved. Our new results rely on recently detected pro...
متن کاملAsymptotically optimal Boolean functions
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conj...
متن کاملComplementary feature sets for optimal face recognition
In face recognition tasks, one kind of feature set is not adequate to generate superior results; thus, selection and combination of complementary features are crucial steps. In this paper, the fusion of two useful descriptors, i.e., the Zernike moments (ZMs) and the local binary pattern (LBP)/local ternary pattern (LTP), has been proposed. The ZM descriptor consists of good global image represe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2021
ISSN: ['1558-2361', '1070-9908']
DOI: https://doi.org/10.1109/lsp.2021.3091886